test = int(input())
while test:
test -= 1
n = int(input())
if(n%3 == 0):
print("{} {} {}".format(n//3, n//3+1, n//3-1))
elif n%3==1:
print("{} {} {}".format(n//3, n//3+2, n//3-1))
else:
print("{} {} {}".format(n//3 + 1, n//3+2, n//3-1))#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define lol long long int
#define ff first
#define ss second
#define All(v) v.begin(),v.end()
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define minus cout<<"-1"<<endl
const int sz = 1e5+5;
const int mod=1e9+7;
const int N=1e6+100;
const int zc=2e5+100;
const int MOD= 998244353;
void fun(){
ll n;
cin>>n;
for(ll i=3;i<n;i++){
ll ans=(n-i)/2;
ll res=(n-i-ans);
if(ans>1 and (res+1<i)){
ans--;res++;
}
if(i>res and res>ans){
cout<<res<<" "<<i<<" "<<ans<<endl;
return;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
fun();
}
return 0;
}946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |